Compositional Reasoning in Model Checking
نویسندگان
چکیده
The main problem in model checking that prevents it from being used for veri cation of large systems is the state explosion problem. This problem often arises from combining parallel processes together. Many techniques have been proposed to overcome this di culty and, thus, increase the size of the systems that model checkers can handle. We describe several compositional model checking techniques used in practice and show a few examples demonstrating their performance.
منابع مشابه
A Survey on Compositional Veri cation
In this survey, we overview several compositional veriication approaches based on model checking, namely compositional minimization, classic assume guarantee reasoning and circular reasoning. We describe details of each of these approaches, and elaborate the general problems with some proposed solutions. We also summarize the advantages and disadvantages of each. In the last section, we give a ...
متن کاملTranslation-Based Compositional Reasoning for Software Systems
Software systems are often model checked by translating them into a directly model-checkable formalism. Any serious software system requires application of compositional reasoning to overcome the computational complexity of model checking. This paper presents Translation-Based Compositional Reasoning (TBCR), an approach to application of compositional reasoning in the context of model checking ...
متن کاملAbstraction and Assume-guarantee Reasoning for Automated Software Verification
ion and Assume-guarantee Reasoning for Automated Software Verification S. Chaki, E. Clarke, D. Giannakopoulou, and C.S. Păsăreanu 1 Carnegie Mellon Software Engineering Institute 2 Carnegie Mellon University 3 RIACS, NASA Ames Research Center, Moffett Field, CA, USA 4 Kestrel Technology LLC, NASA Ames Research Center, Moffett Field, CA, USA Abstract. Compositional verification and abstraction a...
متن کاملA Compositional Proof System for the Modal -Calculus
We present a proof system for determining satisfaction between processes in a fairly general process algebra and assertions of the modal -calculus. The proof system is compositional in the structure of processes. It extends earlier work on compositional reasoning within the modal -calculus and combines it with techniques from work on local model checking. The proof system is sound for all proce...
متن کاملA Compositional Proof System for theModal
We present a proof system for determining satisfaction between processes in a fairly general process algebra and assertions of the modal-calculus. The proof system is compositional in the structure of processes. It extends earlier work on compositional reasoning within the modal-calculus and combines it with techniques from work on local model checking. The proof system is sound for all process...
متن کاملCircular Compositional Reasoning about Liveness
Compositional proofs about systems of many components often involve apparently circular arguments. That is, correctness of component A must be assumed when verifying component B, and vice versa. The apparent circularity of such arguments can be resolved by induction over time. However, previous methods for such circular compositional reasoning apply only to safety properties. This paper present...
متن کامل